Constructing edge-disjoint spanning trees in locally twisted cubes
نویسندگان
چکیده
The use of edge-disjoint spanning trees for data broadcasting and scattering problem in networks provides a number of advantages, including the increase of bandwidth and faulttolerance. In this paper, we present an algorithm for constructing n edge-disjoint spanning trees in ann-dimensional locally twisted cube. Since then-dimensional locally twisted cube is regular with the common degree n, the number of constructed trees is optimal. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Construction independent spanning trees on locally twisted cubes in parallel
Let LTQn denote the n-dimensional locally twisted cube. Hsieh and Tu (2009) [13] presented an algorithm to construct n edge-disjoint spanning trees rooted at vertex 0 in LTQn. Later on, Lin et al. (2010) [23] proved that Hsieh and Tu’s spanning trees are indeed independent spanning trees (ISTs for short), i.e., all spanning trees are rooted at the same vertex r and for any other vertex v(6= r),...
متن کاملA Simple Parallel Algorithm for Constructing Independent Spanning Trees on Twisted Cubes∗
In 1989, Zehavi and Itai [46] proposed the following conjecture: a k-connected graph G must possess k independent spanning trees (ISTs for short) with an arbitrary node as the common root. An n-dimensional twisted cube, denoted by TQn, is a variation of hypercubes with connectivity n to achieving some improvements of structure properties. Recently, Yang [42] proposed an algorithm for constructi...
متن کاملConstructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes
The n-dimensional hypercube network Qn is one of the most popular interconnection networks since it has simple structure and is easy to implement. The ndimensional locally twisted cube, denoted by LTQn, an important variation of the hypercube, has the same number of nodes and the same number of connections per node as Qn. One advantage of LTQn is that the diameter is only about half of the diam...
متن کاملConstruction of Edge-Disjoint Spanning Trees in the Torus and Application to Multicast in Wormhole-Routed Networks
A tree-based multicast algorithm for wormhole-routed torus networks, which makes use of multiple edge-disjoint spanning trees is presented. A technique for constructing two spanning trees in 2-dimensional torus networks is described. It is formally proven that this construction produces two edge-disjoint spanning trees in any 2-D torus network. Compared with an algorithm for construction of mul...
متن کاملNode-pancyclicity and edge-pancyclicity of hypercube variants
Twisted cubes, crossed cubes, Möbius cubes, and locally twisted cubes are some of the widely studied hypercube variants. The 4-pancyclicity of twisted cubes, crossed cubes, Möbius cubes, locally twisted cubes and the 4-edgepancyclicity of crossed cubes are proven in [2, 1, 5, 10, 6] respectively. It should be noted that 4-edge-pancyclicity implies 4-node-pancyclicity which further implies 4-pan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 410 شماره
صفحات -
تاریخ انتشار 2009